Dense packings from algebraic number fields and codes
نویسنده
چکیده
We introduce a new method from number fields and codes to construct dense packings in the Euclidean spaces. Via the canonical Q-embedding of arbitrary number field K into R, both the prime ideal p and its residue field κ can be embedded as discrete subsets in R. Thus we can concatenate the embedding image of the Cartesian product of n copies of p together with the image of a length n code over κ. This concatenation leads to a packing in Euclidean space R. Moreover, we extend the single concatenation to multiple concatenation to obtain dense packings and asymptotically good packing families. For instance, with the help of Magma, we construct one 256-dimensional packing denser than the Barnes-Wall lattice BW256.
منابع مشابه
Dense packings from quadratic fields and codes
In the present paper, we make use of the quadratic field Q( √−3 ) to construct dense packings in the Euclidean spaces. With the help from good error-correcting codes, we are able to produce several packings with the best-known densities. Furthermore, if we assume that the best upper bound in coding theory developed by Aaltonen, Ben-Haim and Litsyn could be achieved, then the Minkowski bound wou...
متن کاملDense Sphere Packings from New Codes
The idea behind the coset code construction (see [G.D. Forney, Coset Codes, IEEE Transactions on Information Theory, Part I: Introduction and Geometrical Classification, pp. 1123–1151; Part II: Binary lattices and related codes, pp. 1152–1187; F.R. Kschischang and S. Pasupathy, IEEE Transactions on Information Theory 38 (1992), 227–246.]) is to reduce the construction of sphere packings to erro...
متن کاملCodes over GF(4) and Complex Lattices
The connections between binary and ternary error-correcting codes on the one hand, and lattices and sphere-packings in W on the other have been studied by several authors [6,7, 19-21,26,29,30,39,40-j. Since the theorem of Gleason, Pierce and Turyn [l, p. 381; 21 states that codes over GF(2), GF(3) and GF(4) have especially nice properties not shared by codes over other fields, one might expect ...
متن کاملDensity Doubling, Double-circulants, and New Sphere Packings
New nonlattice sphere packings in dimensions 20, 22, and 44–47 that are denser than the best previously known sphere packings were recently discovered. We extend these results, showing that the density of many sphere packings in dimensions just below a power of 2 can be doubled using orthogonal binary codes. This produces new dense sphere packings in Rn for n = 25, 26, . . . , 31 and 55, 56, . ...
متن کاملMaximal Order Codes over Number Fields
— We present constructions of codes obtained from maximal orders over number fields. Particular cases include codes from algebraic number fields by Lenstra and Guruswami, codes from units of the ring of integers of number fields, and codes from both additive and multiplicative structures of maximal orders in central simple division algebras. The parameters of interest are the code rate and the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Finite Fields and Their Applications
دوره 45 شماره
صفحات -
تاریخ انتشار 2017